A Hybrid Prefix Cashing Scheme for Efficient IP Address Lookup
نویسندگان
چکیده
منابع مشابه
A memory-efficient scheme for address lookup using compact prefix tries
In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as well as sparse tries. For an IP core ro...
متن کاملAn Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector
Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binar...
متن کاملA Partitioned Binary Search Scheme on Multiple Trees for Efficient IP Address Lookup
IP address lookup is becoming critical because of increasing entries in a forwarding table, linespeed and traffic in the Internet. Binary search is the most popular scheme based on S/W implementation. This search scheme has problems according to the parentchild relationship of prefixes. In this paper, we proposed the partitioned binary search scheme to split the parentchild relationship. All pr...
متن کاملHybrid Key Duplication Hashing Techniques for IP Address Lookup
In the past decade there has been an increasing need for designs to address the time and cost efficiency issues from various computer network applications such as general IP address lookup and specific network intrusion detection. Hashing techniques have been widely adopted for this purpose, among which XOR-operation-based hashing is one of most popular techniques due to its relatively small ha...
متن کاملA New Efficient IP Address Lookup Based on Binary Search
IP address lookup is an important function in a router to settle overall performance of the router. Binary search on range is a useful algorithm based on binary search for IP address lookup. However, this approach requires a lot of memories for adapting binary search to variable-length prefixes. We propose the improved algorithm to reduce memory requirements than binary search on range dramatic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2015
ISSN: 1598-849X
DOI: 10.9708/jksci.2015.20.12.045